A Task and Motion Planning Algorithm for the Dubins Travelling Salesperson Problem
نویسندگان
چکیده
A new motion planning algorithm for the so-called Dubins Travelling Salesperson Problem is derived, and compared via simulations with a number of existing algorithms from the literature. In its general form, the new algorithm is dubbed “k-step look-ahead algorithm” and stems naturally from the formulation of the Dubins Travelling Salesperson Problem as a minimum-time control problem. When the minimum turning radius of the Dubins vehicle is comparable to the average intercity distance, the simulations yield a comparison favourable to the new algorithm. The examples in the paper are confined to small instances of the Dubins Travelling Salesperson Problem, however the main idea behind the k-step look-ahead algorithm can be combined with different optimisation methods, if larger instances of the DTSP are to be considered.
منابع مشابه
On the Dubins Traveling Salesperson Problems: Novel Approximation Algorithms
In this paper we study minimum-time motion planning and routing problems for the Dubins vehicle, i.e., a nonholonomic vehicle that is constrained to move along planar paths of bounded curvature, without reversing direction. Motivated by autonomous aerial vehicle applications, we consider the Traveling Salesperson Problem for the Dubins vehicle (DTSP): given n points on a plane, what is the shor...
متن کاملAsymptotic constant-factor approximation algorithm for the Traveling Salesperson Problem for Dubins' vehicle
This article proposes the first known algorithm that achieves a constant-factor approximation of the minimum length tour for a Dubins’ vehicle through n points on the plane. By Dubins’ vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without reversing direction. For this version of the classic Traveling Salesperson Problem, our algorithm closes...
متن کاملOn Traveling Salesperson Problems for Dubins’ vehicle: stochastic and dynamic environments
In this paper we propose some novel planning and routing strategies for Dubins’ vehicle, i.e., for a nonholonomic vehicle moving along paths with bounded curvature, without reversing direction. First, we study a stochastic version of the Traveling Salesperson Problem (TSP): given n targets randomly sampled from a uniform distribution in a rectangle, what is the shortest Dubins’ tour through the...
متن کاملTraveing Salesperson Problems for a double integrator
In this paper we propose some novel path planning strategies for a double integrator with bounded velocity and bounded control inputs. First, we study the following version of the Traveling Salesperson Problem (TSP): given a set of points in R, find the fastest tour over the point set for a double integrator. We first give asymptotic bounds on the time taken to complete such a tour in the worst...
متن کاملMotion planning for multi-robot assembly systems
This paper addresses a multi-robot optimal assembly planning problem which in essence is an augmented Travelling Salesperson Problem (TSP+). In our TSP+, both the “salesperson” (a robot with a tool) as well as the “cities” (another robot with a workpiece) move. Namely, in addition to the sequencing of tasks, further planning is required to choose where the “salesperson” should rendezvous with e...
متن کامل